3 Quantum Guessing via Deutsch - Jozsa
نویسنده
چکیده
We examine the “Guessing Secrets” problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon the best known classical result, which uses O(logN) questions and requires an additional O(logN3) steps to produce the answer. In showing the possibilities of this algorithm, we extend the types of questions and function oracles that the Deutsch-Jozsa algorithm can be used to solve.
منابع مشابه
J an 2 00 3 Quantum Guessing via Deutsch - Jozsa
We begin with a variation of classical 20 questions and propose a quantum algorithm to solve it efficiently and in time independent of the size of the object set. In the process, we extend the types of questions and function oracles that the Deutsch-Jozsa algorithm can be used to solve.
متن کاملNMR quantum computation with indirectly coupled gates
An NMR realization of a two-qubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the Deutsch-Jozsa algorithm. This enables a successful comprehensive NMR implementation of the Deutsch-Jozsa algorithm for functions with three argument bits and demonstrates a technique essential for multi-qubit quantum computation.
متن کاملAn implementation of the Deutsch-Jozsa algorithm on a three-qubit NMR quantum computer
A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit quantum computer has been investigated using the 400 MHz NMR spectrum of the three coupled protons in 2,3dibromopropanoic acid. It has been employed to impl...
متن کاملBroken promises and quantum algorithms
In the black-box model, promise problems are the only ones that admit a quantum exponential speedup over the best classical algorithm in terms of query complexity. The most prominent example of this is the Deutsch-Jozsa algorithm. More recently, Wim van Dam put forward an algorithm for unstructured problems (ie, those without a promise). We consider the Deutsch-Jozsa algorithm with a less restr...
متن کاملEfficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack ...
متن کامل